Tutte sets in graphs II: The complexity of finding maximum Tutte sets

Tutte sets in graphs I: Maximal tutte sets and D-graphs

A well-known formula of Tutte and Berge expresses the size of a maximum matching in G in terms of what is usually called the deficiency of G. A subset X of G for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this paper, we study the structural aspects of maximal Tutte sets in a graph...

Bounded Treewidth Graphs – A Survey German Russian Winter School St. Petersburg, Russia

This survey gives an introduction to the class of bounded treewidth graphs, for which many NP-complete problems can be solved efficiently. The concept of a tree decomposition is explained. Subclasses of the bounded treewidth graphs are identified. Results about finding tree decompositions are summarized. Some problems which are efficiently solvable on bounded treewidth graphs are listed and alg...

Tutte Polynomials of Flower Graphs

Polynomial invariants of graphs II

Negami and Kawagoe has already defined a polynomial f(G) associated with each graph G as what discriminates graphs more finely than the polynomial f(G) definedby Negami and the Tutte polynomial. In this paper, we shall show that the polynomial f(G) includes potentially the generating function counting the independent sets and the degree sequence of a graph G, which cannot be recognized from f(G...

Linear Relations for a Generalized Tutte Polynomial

Brylawski proved the coefficients of the Tutte polynomial of a matroid satisfy a set of linear relations. We extend these relations to a generalization of the Tutte polynomial that includes greedoids and antimatroids. This leads to families of new identities for antimatroids, including trees, posets, chordal graphs and finite point sets in Rn. It also gives a “new” linear relation for matroids ...